﻿ #define _CRT_SECURE_NO_WARNINGS 1

 class KthLargest
 {
	 // 创建⼀个⼤⼩为 k 的⼩跟堆
		4 priority_queue<int, vector<int>, greater<int>> heap;
	 int _k;
	
 public:
	 KthLargest(int k, vector<int>&nums)
		 {
		 _k = k;
		 for (auto x : nums)
			 {
			 heap.push(x);
			 if (heap.size() > _k) heap.pop();
			 }
		 }
	
		 int add(int val)
		 {
		 heap.push(val);
		 if (heap.size() > _k) heap.pop();
		 return heap.top();
		 }
	 };